Proposal Title : Application of Evolutionary Computation to Opponent Modeling in Games of Imperfect
نویسنده
چکیده
The video game industry is an area of high and increasing profitability, with $US 6 billion spent by U.S. consumers alone in the year 2001 [1]. In order to attract buyers, there is increasing demand to simulate human opponents artificially within games. As of present, artificial opponents commonly have their game-playing strategies coded in advance, often resulting in overly simplistic and predictable opponents whose flaws are easily exploitable. Games such as Bridge, Poker and Scrabble are games of imperfect information, meaning that not all the information about the state of the game is known (e.g. hidden opponent cards in Poker). Due to the non-deterministic nature of such games and the need for opponent modeling, the task of determining satisfactory strategies is extremely broad and difficult to be programmed for in advance. To make games more interactive, it is necessary to have computer opponents that learn and adapt; opponents who are free to function within the rules of the game, rather than some predefined subset conceived by the programmer. The ideal situation would be to create an artificial opponent that is able to adopt various game-playing strategies and appear indistinguishable from a human player.
منابع مشابه
Robust Opponent Modeling in Real-Time Strategy Games using Bayesian Networks
Opponent modeling is a key challenge in Real-Time Strategy (RTS) games as the environment is adversarial in these games, and the player cannot predict the future actions of her opponent. Additionally, the environment is partially observable due to the fog of war. In this paper, we propose an opponent model which is robust to the observation noise existing due to the fog of war. In order to cope...
متن کاملBuilding Opponent Model in Imperfect Information Board Games
In imperfect information problems, board game is a class of special problem that differs from card games like poker. Several characters make it a valuable test bed for opponent modeling, which is one of the most difficult problems in artificial intelligence decision systems. In card games, opponent modeling has proved its importance on improving agents’ strength. In this paper, a method of buil...
متن کاملGame theory-based opponent modeling in large imperfect-information games
We develop an algorithm for opponent modeling in large extensive-form games of imperfect information. It works by observing the opponent’s action frequencies and building an opponent model by combining information from a precomputed equilibrium strategy with the observations. It then computes and plays a best response to this opponent model; the opponent model and best response are both updated...
متن کاملEvolving Adaptive Play for the Game of Spoof
For game playing in general it is important for players to be adaptive, this is particularly true for games where no optimal fixed strategy is known to exist. Adaptive artificial opponents capable of learning and opponent modelling are highly desirable in computer games. Typically, a great deal of a game’s ability to maintain the interest of human players is provided by multiplayer functionalit...
متن کاملAccelerating Best Response Calculation in Large Extensive Games
ion Size (# information sets) A X Y To determine our payoff at A, we need to know the distribution over the opponent being in X and Y. Recursive tree walk algorithm: PASS FORWARDS: An array of probabilities of the opponent being in each of their information sets (X and Y) RETURN: Our value at our information set, given the opponent distribution. Only visits each game state once. But in big doma...
متن کامل